From extensional to intensional description

Abstract: Quantum search is well suited to spaces that can be described in brief encodings, such as integers or a set of algorithmic transformations in an abbreviated representation, but needs adaptation to deal efficiently with datasets. A method is presented for exploiting the global aggregation properties of a search operator so that the data space (extension) and algorithmic space can be explored in parallel rather than in succession. 2001 Optical Society of America OCIS codes: (000.1600) Classical and quantum physics (000.5490) Probability theory, stochastic processes, and statistics